From Task Graphs to Petri Nets
نویسنده
چکیده
This paper describes the similarities between task graphs and Petri nets and explains how a well formed task graph can be converted or transformed into a Petri net for verification, validation and checking using incidence matrix analysis, invariants and the reachability graph. A case study is presented, results and conclusions are given. Keywords—, Petri nets, Task Graphs, Transformation, Verification, Well formedness
منابع مشابه
Soccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملA Graph Theoretic Approach: Petri net
This work attempts to understand some of the basic properties of Petri nets and their relationships to directed bipartite graphs. Different forms of directed graphs are widely used in computer science. Normally various names are given to these structures. E.g. directed acyclic graphs (DAGs), control flow graphs (CFGs), task graphs, generalized task graphs (GTGs), state transition diagrams (STDs...
متن کاملModeling and Analysis of a Cruise Control System
This paper examines the modeling and analysis of a cruise control system using a Petri net based approach, task graphs, invariant analysis and behavioral properties. It shows how the structures used can be verified and optimized. Keywords—Software Engineering, Real Time Analysis and Design, Petri Nets, Task Graphs, Parallelism.
متن کاملAlgebraic Higher-Order Nets: Graphs and Petri Nets as Tokens
Petri nets and Algebraic High-Level Nets are well-known to model parallel and concurrent systems. In this paper, we introduce the concept of Algebraic Higher-Order Nets, which allow to have dynamical tokens like graphs or (ordinary low-level) Petri nets. For this purpose, we specify graphs and Petri nets in the higher-order algebraic specification language HasCasl such that graphs and Petri net...
متن کاملRelationships between Petri Nets and Constraint Graphs: Application to Manufacturing
The purpose of the paper is to compare timed and time Petri nets with constraint satisfaction problems and activity-on-arc graphs in the context of manufacturing. It is shown that constraints are not defined in the same way but that timed and time Petri nets could be translated into a set of activity-on-arc graphs. This translation is only straightforward for p-timed and p-time Petri nets.
متن کامل